Adiar Binary Decision Diagrams in External Memory

We follow up on the idea of Lars Arge to rephrase Reduce and Apply procedures Binary Decision Diagrams (BDDs) as iterative I/O-efficient algorithms. identify multiple avenues simplify improve performance his proposed Furthermore, we extend technique other common BDD operations, many which are not derivable using operations alone, provide asymptotic improvements for that can be derived Apply. These algorithms implemented in a new package, named Adiar. see very promising results when comparing Adiar with conventional packages use recursive depth-first For instances larger than 8.2 GiB, our algorithms, parts disk, 1.47 3.69 times slower compared CUDD Sylvan, exclusively main memory. Yet, techniques able obtain this at fraction memory needed by function. manipulate BDDs outgrow so surpass limits packages.